全文获取类型
收费全文 | 2410篇 |
免费 | 134篇 |
国内免费 | 93篇 |
专业分类
化学 | 430篇 |
晶体学 | 4篇 |
力学 | 73篇 |
综合类 | 37篇 |
数学 | 1594篇 |
物理学 | 499篇 |
出版年
2023年 | 13篇 |
2022年 | 46篇 |
2021年 | 46篇 |
2020年 | 46篇 |
2019年 | 31篇 |
2018年 | 38篇 |
2017年 | 48篇 |
2016年 | 62篇 |
2015年 | 48篇 |
2014年 | 108篇 |
2013年 | 152篇 |
2012年 | 114篇 |
2011年 | 135篇 |
2010年 | 143篇 |
2009年 | 176篇 |
2008年 | 196篇 |
2007年 | 202篇 |
2006年 | 120篇 |
2005年 | 124篇 |
2004年 | 109篇 |
2003年 | 77篇 |
2002年 | 76篇 |
2001年 | 67篇 |
2000年 | 69篇 |
1999年 | 53篇 |
1998年 | 56篇 |
1997年 | 35篇 |
1996年 | 45篇 |
1995年 | 31篇 |
1994年 | 22篇 |
1993年 | 27篇 |
1992年 | 16篇 |
1991年 | 11篇 |
1990年 | 10篇 |
1989年 | 9篇 |
1988年 | 13篇 |
1987年 | 8篇 |
1986年 | 6篇 |
1985年 | 8篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 5篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 8篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1969年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有2637条查询结果,搜索用时 15 毫秒
61.
Sylvio Barbon Jr. Rodrigo Capobianco Guido Lucimar Sasso Vieira Everthon Silva Fonseca Fabrício Lopes Sanchez Paulo Rogério Scalassara Carlos Dias Maciel José Carlos Pereira Shi-Huang Chen 《Journal of Computational and Applied Mathematics》2009
Dynamic Time Warping (DTW), a pattern matching technique traditionally used for restricted vocabulary speech recognition, is based on a temporal alignment of the input signal with the template models. The principal drawback of DTW is its high computational cost as the lengths of the signals increase. This paper shows extended results over our previously published conference paper, which introduces an optimized version of the DTW that is based on the Discrete Wavelet Transform (DWT). 相似文献
62.
In this paper we present a case study from the lighting industry concerned with the scheduling of a set of job families each representing the production of a particular end-item in a given quantity. It is a job shop type problem, where each job family has a number of routing alternatives, and the solution has to respect batching and machine availability constraints. All jobs of the same job family have a common release date and a common due date, and they differ only in size. The objective is to minimize the total tardiness of the job families, rather than that of individual jobs. We propose a two-phase method based on solving a mixed-integer linear program and then improving the initial solution by tabu search. We evaluate our method on real-world as well as generated instances. 相似文献
63.
The job shop scheduling problem (JSSP) is a notoriously difficult problem in combinatorial optimization. Extensive investigation has been devoted to developing efficient algorithms to find optimal or near-optimal solutions. This paper proposes a new heuristic algorithm for the JSSP that effectively combines the classical shifting bottleneck procedure (SBP) with a dynamic and adaptive neighborhood search procedure. Our new search method, based on a filter-and-fan (F&F) procedure, uses the SBP as a subroutine to generate a starting solution and to enhance the best schedules produced. The F&F approach is a local search procedure that generates compound moves by a strategically abbreviated form of tree search. Computational results carried out on a standard set of 43 benchmark problems show that our F&F algorithm performs more robustly and effectively than a number of leading metaheuristic algorithms and rivals the best of these algorithms. 相似文献
64.
A hybrid genetic local search algorithm for the permutation flowshop scheduling problem 总被引:1,自引:0,他引:1
Traditionally, the permutation flowshop scheduling problem (PFSP) was with the criterion of minimizing makespan. The permutation flowshop scheduling problem to minimize the total flowtime has attracted more attention from researchers in recent years. In this paper, a hybrid genetic local search algorithm is proposed to solve this problem with each of both criteria. The proposed algorithm hybridizes the genetic algorithm and a novel local search scheme that combines two local search methods: the Insertion Search (IS) and the Insertion Search with Cut-and-Repair (ISCR). It employs the genetic algorithm to do the global search and two local search methods to do the local search. Two local search methods play different roles in the search process. The Insertion Search is responsible for searching a small neighborhood while the Insertion Search with Cut-and-Repair is responsible for searching a large neighborhood. Furthermore, the orthogonal-array-based crossover operator is designed to enhance the GA’s capability of intensification. The experimental results show the advantage of combining the two local search methods. The performance of the proposed hybrid genetic algorithm is very competitive. For the PFSP with the total flowtime criterion, it improved 66 out of the 90 current best solutions reported in the literature in short-term search and it also improved all the 20 current best solutions reported in the literature in long-term search. For the PFSP with the makespan criterion, the proposed algorithm also outperforms the other three methods recently reported in the literature. 相似文献
65.
The aim of this paper is to present a thorough reassessment of the Snyman–Fatti (SF) Multi-start Global Minimization Algorithm with Dynamic Search Trajectories, first published twenty years ago. The reassessment is done with reference to a slightly modified version of the original
method, the essentials of which are summarized here. Results of the performance of the current code on an extensive set of
standard test problems commonly in use today, are presented. This allows for a fair assessment to be made of the performance
of the SF algorithm relative to that of the popular Differential Evolution (DE) method, for which test results on the same
standard set of test problems used here for the SF algorithm, are also given. The tests show that the SF algorithm, that requires
relatively few parameter settings, is a reliably robust and competitive method compared to the DE method. The results also
indicate that the SF trajectory algorithm is particularly promising to solve minimum potential energy problems to determine
the structure of atomic and molecular clusters. 相似文献
66.
We show that the principal order ideal of an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45312 and 456123. Similar criteria for signed permutations are also stated. Involutions with this
property are enumerated with respect to natural statistics. In this context, a bijective correspondence with certain Motzkin
paths is demonstrated.
This article is largely based on results from the second author’s M.Sc. thesis [15]. 相似文献
67.
基于串级质谱信息进行蛋白质数据库搜索的结果可靠性分析 总被引:1,自引:0,他引:1
SEQUEST与Mascot为目前蛋白组学分析研究中使用最为广泛的蛋白质库搜索工具.尝试将Mascot与SEQUEST搜索结果进行比较,进而采用不同多变量判别方法对二者的搜索结果进行判别分析,以降低其结果的假阳性率.通过对Mascot与SEQUEST搜索结果进行比较,发现所得结果差异很大;利用多变量判别分析方法对Mascot及SEQUEST搜索结果进行判别分析,可有效提高SEQUEST结果中假阳性结果与正确结果之间的区分能力.对于Mascot搜索结果,采用多变量判别分析方法仍无法显著降低其假阳性结果,利用Decoy库搜索结果进行估计时亦存在导致错误估计的风险. 相似文献
68.
一类新的非单调记忆梯度法及其全局收敛性 总被引:1,自引:0,他引:1
在非单调Armijo线搜索的基础上提出一种新的非单调线搜索,研究了一类在该线搜索下的记忆梯度法,在较弱条件下证明了其全局收敛性。与非单调Armijo线搜索相比,新的非单调线搜索在每次迭代时可以产生更大的步长,从而使目标函数值充分下降,降低算法的计算量。 相似文献
69.
本文利用一个修正的BFGS公式,提出了一个结合Armijo线搜索条件技术的BFGS信赖域方法,并在一定条件下证明了该方法的全局收敛性和超线性收敛性.初步的数值实验结果表明该方法是有效的. 相似文献
70.